using greedy clustering method to solve capacitated location-routing problem with fuzzy demands

using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customersthat have fuzzy demands. to model the clrp_fd, a fuzzy chance constrained program is designed, based on fuzzy credibility theory. to solve the clrp_fd, a greedy clustering method (gcm) including the stochastic simulation is proposed. finally, to obtain the best value of the preference index of the model and analysis its influence on the final solutions of the problem, numerical experiments are carried out. keywords: capacitated location routing problem, fuzzy demand, credibility theory, stochastic simulation, ant colony system.